46 research outputs found

    An Introductory Guide to Aligning Networks Using SANA, the Simulated Annealing Network Aligner.

    Get PDF
    Sequence alignment has had an enormous impact on our understanding of biology, evolution, and disease. The alignment of biological networks holds similar promise. Biological networks generally model interactions between biomolecules such as proteins, genes, metabolites, or mRNAs. There is strong evidence that the network topology-the "structure" of the network-is correlated with the functions performed, so that network topology can be used to help predict or understand function. However, unlike sequence comparison and alignment-which is an essentially solved problem-network comparison and alignment is an NP-complete problem for which heuristic algorithms must be used.Here we introduce SANA, the Simulated Annealing Network Aligner. SANA is one of many algorithms proposed for the arena of biological network alignment. In the context of global network alignment, SANA stands out for its speed, memory efficiency, ease-of-use, and flexibility in the arena of producing alignments between two or more networks. SANA produces better alignments in minutes on a laptop than most other algorithms can produce in hours or days of CPU time on large server-class machines. We walk the user through how to use SANA for several types of biomolecular networks

    Simultaneous Optimization of Both Node and Edge Conservation in Network Alignment via WAVE

    Full text link
    Network alignment can be used to transfer functional knowledge between conserved regions of different networks. Typically, existing methods use a node cost function (NCF) to compute similarity between nodes in different networks and an alignment strategy (AS) to find high-scoring alignments with respect to the total NCF over all aligned nodes (or node conservation). But, they then evaluate quality of their alignments via some other measure that is different than the node conservation measure used to guide the alignment construction process. Typically, one measures the amount of conserved edges, but only after alignments are produced. Hence, a recent attempt aimed to directly maximize the amount of conserved edges while constructing alignments, which improved alignment accuracy. Here, we aim to directly maximize both node and edge conservation during alignment construction to further improve alignment accuracy. For this, we design a novel measure of edge conservation that (unlike existing measures that treat each conserved edge the same) weighs each conserved edge so that edges with highly NCF-similar end nodes are favored. As a result, we introduce a novel AS, Weighted Alignment VotEr (WAVE), which can optimize any measures of node and edge conservation, and which can be used with any NCF or combination of multiple NCFs. Using WAVE on top of established state-of-the-art NCFs leads to superior alignments compared to the existing methods that optimize only node conservation or only edge conservation or that treat each conserved edge the same. And while we evaluate WAVE in the computational biology domain, it is easily applicable in any domain.Comment: 12 pages, 4 figure

    The Correlation Between Hepatitis B Virus Precore/Core Mutations and the Progression of Severe Liver Disease

    Get PDF
    Viral mutations acquired during the course of chronic hepatitis B virus (HBV) infection are known to be associated with the progression and severity of HBV-related liver disease. This study of HBV-infected Saudi Arabian patients aimed to identify amino acid substitutions within the precore/core (preC/C) region of HBV, and investigate their impact on disease progression toward hepatocellular carcinoma (HCC). Patients were categorized according to the severity of their disease, and were divided into the following groups: inactive HBV carriers, active HBV carriers, liver cirrhosis patients, and HCC patients. Two precore mutations, W28* and G29D, and six core mutations, F24Y, E64D, E77Q, A80I/T/V, L116I, and E180A were significantly associated with the development of cirrhosis and HCC. Six of the seven significant core mutations that were identified in this study were located within immuno-active epitopes; E77Q, A80I/T/V, and L116I were located within B-cell epitopes, and F24Y, E64D, and V91S/T were located within T-cell epitopes. Multivariate risk analysis confirmed that the core mutations A80V and L116I were both independent predictors of HBV-associated liver disease progression. In conclusion, our data show that mutations within the preC/C region, particularly within the immuno-active epitopes, may contribute to the severity of liver disease in patients with chronic hepatitis. Furthermore, we have identified several distinct preC/C mutations within the study population that affect the clinical manifestation and progression of HBV-related disease. The specific identity of HBV mutations that are associated with severe disease varies between different ethnic populations, and so the specific preC/C mutations identified here will be useful for predicting clinical outcomes and identifying the HBV-infected patients within the Saudi population that are at high risk of developing HCC

    An introductory guide to aligning networks using SANA, the Simulated Annealing Network Aligner

    Full text link
    Sequence alignment has had an enormous impact on our understanding of biology, evolution, and disease. The alignment of biological {\em networks} holds similar promise. Biological networks generally model interactions between biomolecules such as proteins, genes, metabolites, or mRNAs. There is strong evidence that the network topology -- the "structure" of the network -- is correlated with the functions performed, so that network topology can be used to help predict or understand function. However, unlike sequence comparison and alignment -- which is an essentially solved problem -- network comparison and alignment is an NP-complete problem for which heuristic algorithms must be used. Here we introduce SANA, the {\it Simulated Annealing Network Aligner}. SANA is one of many algorithms proposed for the arena of biological network alignment. In the context of global network alignment, SANA stands out for its speed, memory efficiency, ease-of-use, and flexibility in the arena of producing alignments between 2 or more networks. SANA produces better alignments in minutes on a laptop than most other algorithms can produce in hours or days of CPU time on large server-class machines. We walk the user through how to use SANA for several types of biomolecular networks. Availability: https://github.com/waynebhayes/SAN

    PROPER: global protein interaction network alignment through percolation matching

    Get PDF
    Background The alignment of protein-protein interaction (PPI) networks enables us to uncover the relationships between different species, which leads to a deeper understanding of biological systems. Network alignment can be used to transfer biological knowledge between species. Although different PI-network alignment algorithms were introduced during the last decade, developing an accurate and scalable algorithm that can find alignments with high biological and structural similarities among PPI networks is still challenging. Results In this paper, we introduce a new global network alignment algorithm for PPI networks called PROPER. Compared to other global network alignment methods, our algorithm shows higher accuracy and speed over real PPI datasets and synthetic networks. We show that the PROPER algorithm can detect large portions of conserved biological pathways between species. Also, using a simple parsimonious evolutionary model, we explain why PROPER performs well based on several different comparison criteria. Conclusions We highlight that PROPER has high potential in further applications such as detecting biological pathways, finding protein complexes and PPI prediction. The PROPER algorithm is available at http://proper.epfl.ch

    Molecular epidemiology, phylogenetic analysis and genotype distribution of hepatitis B virus in Saudi Arabia: Predominance of genotype D1

    No full text
    Despite the implementation of various vaccination programs, hepatitis B virus (HBV) poses a considerable health problem in Saudi Arabia. Insight on HBV evolutionary history in the region is limited. We performed a comprehensive epidemiological and phylogenetic reconstruction based on a large cohort of HBV infected patients. Three hundred and nineteen HBV-infected patients with different clinical manifestations, including inactive and active chronic carriers and patients with cirrhosis and hepatocellular carcinoma (HCC), were enrolled in this study. The full-length large S gene was amplified and sequenced. Phylogenetic analysis was performed to determine the genotype and subgenotypes of the isolates. Phylogenetic tree analysis revealed that genotype D is the most dominant genotype among patients. Moreover, this analysis identified two strains with genotype E isolated from active carriers. Detailed phylogenetic analyses confirmed the presence of four HBV D subgenotypes, D1 (93%, n = 296), D2 (0.02%, n = 5), D3 (0.003%, n = 1), and D4 (0.003%, n = 1). In addition, six genotype D strains were not assigned to any existing HBV D subgenotype. The large S gene of eight strains showed signatures of genotype recombination between the genotypes D and A and between D and E. Several strains harbored medically important point mutations at the protein level. Along with the dominance of the HBV genotype D, isolation of the E genotype and several recombinant strains from patients with Saudi Arabian origin is an essential result for decisions involving therapeutic measures for patients. Development of vaccines and detection of diagnostic escape mutations at antigenic epitopes on the HBsAg will be valuable to public health authorities. Furthermore, the diversity at the nucleotide and amino acid levels and different proportions of dN/dS at the PreS1, PreS2, and HBsAg reveal the selective pressure trend from inactive status towards advanced liver diseases.status: Published onlin
    corecore